Cell-centric and user-centric multi-user scheduling in visible light communication aided networks

Visible Light Communication (VLC) combined withadvanced illumination has been expected to become an integralpart of next generation heterogeneous networks at the time ofwriting, by inspiring further research interests. From both theCell-Centric (CC) and the User-Centric (UC) perspectives, variousVLC cell formations, ranging from fixed-shape regular cellswith different Frequency Reuse (FR) patterns and merged cellsemploying advanced transmission scheme to amorphous userspecificcells are investigated. Furthermore, different Multi-UserScheduling (MUS) algorithms achieving Proportional Fairness(PF) are implemented according to different cell formations.By analysing some critical and unique characteristics of VLC,our simulation results demonstrate that, the proposed MUSalgorithms are capable of providing a high aggregate throughputand achieving modest fairness with low complexity in most of thescenarios considered.<br/

Codebook Based Hybrid Precoding for Millimeter Wave Multiuser Systems

In millimeter wave (mmWave) systems, antenna architecture limitations make it difficult to apply conventional fully digital precoding techniques but call for low cost analog radio-frequency (RF) and digital baseband hybrid precoding methods. This paper investigates joint RF-baseband hybrid precoding for the downlink of multiuser multi-antenna mmWave systems with a limited number of RF chains. Two performance measures, maximizing the spectral efficiency and the energy efficiency of the system, are considered. We propose a codebook based RF precoding design and obtain the channel state information via a beam sweep procedure. Via the codebook based design, the original system is transformed into a virtual multiuser downlink system with the RF chain constraint. Consequently, we are able to simplify the complicated hybrid precoding optimization problems to joint codeword selection and precoder design (JWSPD) problems. Then, we propose efficient methods to address the JWSPD problems and jointly optimize the RF and baseband precoders under the two performance measures. Finally, extensive numerical results are provided to validate the effectiveness of the proposed hybrid precoders.Comment: 35 pages, 9 figures, to appear in Trans. on Signal Process, 201

Algorithms and complexity for approximately counting hypergraph colourings and related problems

The past decade has witnessed advancements in designing efficient algorithms for approximating the number of solutions to constraint satisfaction problems (CSPs), especially in the local lemma regime. However, the phase transition for the computational tractability is not known. This thesis is dedicated to the prototypical problem of this kind of CSPs, the hypergraph colouring. Parameterised by the number of colours q, the arity of each hyperedge k, and the vertex maximum degree Δ, this problem falls into the regime of Lovász local lemma when Δ ≲ qᵏ. In prior, however, fast approximate counting algorithms exist when Δ ≲ qᵏ/³, and there is no known inapproximability result. In pursuit of this, our contribution is two-folded, stated as follows. • When q, k ≥ 4 are evens and Δ ≥ 5·qᵏ/², approximating the number of hypergraph colourings is NP-hard. • When the input hypergraph is linear and Δ ≲ qᵏ/², a fast approximate counting algorithm does exist